Ehrhart Theory of Spanning Lattice Polytopes
نویسندگان
چکیده
منابع مشابه
Ehrhart Polynomials of Lattice-face Polytopes
There is a simple formula for the Ehrhart polynomial of a cyclic polytope. The purpose of this paper is to show that the same formula holds for a more general class of polytopes, lattice-face polytopes. We develop a way of decomposing any d-dimensional simplex in general position into d! signed sets, each of which corresponds to a permutation in the symmetric group Sd, and reduce the problem of...
متن کاملA Note on Lattice-face Polytopes and Their Ehrhart Polynomials
We give a new definition of lattice-face polytopes by removing an unnecessary restriction in [6], and show that with the new definition, the Ehrhart polynomial of a lattice-face polytope still has the property that each coefficient is the normalized volume of a projection of the original polytope. Furthermore, we show that the new family of lattice-face polytopes contains all possible combinato...
متن کاملEhrhart polynomials of cyclic polytopes
Abstract. The Ehrhart polynomial of an integral convex polytope counts the number of lattice points in dilates of the polytope. In [1], the authors conjectured that for any cyclic polytope with integral parameters, the Ehrhart polynomial of it is equal to its volume plus the Ehrhart polynomial of its lower envelope and proved the case when the dimension d = 2. In our article, we prove the conje...
متن کاملLattice polytopes in coding theory
In this paper we discuss combinatorial questions about lattice polytopes motivated by recent results on minimum distance estimation for toric codes. We also include a new inductive bound for the minimum distance of generalized toric codes. As an application, we give new formulas for the minimum distance of generalized toric codes for special lattice point configurations. 2010 MSC: 14M25, 14G50,...
متن کاملEhrhart Polynomials of Matroid Polytopes and Polymatroids
We investigate properties of Ehrhart polynomials for matroid polytopes, independence matroid polytopes, and polymatroids. In the first half of the paper we prove that for fixed rank their Ehrhart polynomials are computable in polynomial time. The proof relies on the geometry of these polytopes as well as a new refined analysis of the evaluation of Todd polynomials. In the second half we discuss...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Mathematics Research Notices
سال: 2017
ISSN: 1073-7928,1687-0247
DOI: 10.1093/imrn/rnx065